Assessing h- and g-Indices of Scientific Papers using k-Means Clustering

نویسندگان

  • Govinda Rao
  • A. Govardhan
  • Richard Van Noorden
  • Jerry A. Jacobs
  • Scott Frickel
چکیده

K-means clustering technique works as a greedy algorithm for partition the n-samples into k-clusters so as to reduce the sum of the squared distances to the centroids. A very familiar task in data analysis is that of grouping a set of objects into subsets such that all elements within a group are more related among them than they are to the others. K-means clustering is a method of grouping items into k groups. In this work, an attempt has been made to study the importance of clustering techniques on hand g-indices, which are prominent markers of scientific excellence in the fields of publishing papers in various national and international journals. From the analysis, it is evidenced that k-means clustering algorithm has successfully partitioned the set of 18 observations into 3 clusters.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

رتبه بندی اعضای هیأت علمی دانشگاه علوم پزشکی ، خدمات درمانی ایران بر اساس شاخص های هرش، g و پارامتر m تا پایان سال 2008

Introduction: One of the scientific members of faculties’ gradation criteria is evaluation of their publications’ quantity and quality. H-index, G-index, and m parameter are used recently. This paper was aimed to assessment faculties’ publications’ quantity and quality, and citation ranking of IUMS’ faculties by using those indices. Methods: This is a descriptive- applied study, used checklist,...

متن کامل

A Hybrid Data Clustering Algorithm Using Modified Krill Herd Algorithm and K-MEANS

Data clustering is the process of partitioning a set of data objects into meaning clusters or groups. Due to the vast usage of clustering algorithms in many fields, a lot of research is still going on to find the best and efficient clustering algorithm. K-means is simple and easy to implement, but it suffers from initialization of cluster center and hence trapped in local optimum. In this paper...

متن کامل

Comparing Model-based Versus K-means Clustering for the Planar Shapes

‎In some fields‎, ‎there is an interest in distinguishing different geometrical objects from each other‎. ‎A field of research that studies the objects from a statistical point of view‎, ‎provided they are‎ ‎invariant under translation‎, ‎rotation and scaling effects‎, ‎is known as the statistical shape analysis‎. ‎Having some objects that are registered using key points on the outline...

متن کامل

Performance Validation of the Modified K-Means Clustering Algorithm Clusters Data

In this paper, we present the Modified K-Means Clustering algorithm Analysis and performance, the clustering analysis can be used to partition the cluster data with number of choice clusters and perform each cluster if it can form properly or not and it can pertain by using the silhouette coefficient method. In this one the silhouette coefficient can apply on the group of author’s Hand G-indice...

متن کامل

A hybrid DEA-based K-means and invasive weed optimization for facility location problem

In this paper, instead of the classical approach to the multi-criteria location selection problem, a new approach was presented based on selecting a portfolio of locations. First, the indices affecting the selection of maintenance stations were collected. The K-means model was used for clustering the maintenance stations. The optimal number of clusters was calculated through the Silhou...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2014